Geometrical Inverse Preconditioning for Symmetric Positive Definite Matrices

نویسندگان

  • Jean-Paul Chehab
  • Marcos Raydan
چکیده

We focus on inverse preconditioners based on minimizing F(X) = 1− cos(XA, I), where XA is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F(X) on a suitable compact set. For this, we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of F(X) on the feasible set. Preliminary and encouraging numerical results are also presented in which dense and sparse approximations are included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Inverse Preconditioning for Shifted Linear Systems

In this paper we consider the problem of preconditioning symmetric positive definite matrices of the form Aα = A+αI where α > 0. We discuss how to cheaply modify an existing sparse approximate inverse preconditioner for A in order to obtain a preconditioner for Aα. Numerical experiments illustrating the performance of the proposed approaches are presented. AMS subject classification (2000): 65F...

متن کامل

Stair Matrices and Their Generalizations with Applications to Iterative Methods Ii: Iteration Arithmetic and Preconditionings

Iteration arithmetic is formally introduced based on iteration multiplication and αaddition which is a special multisplitting. This part focuses on construction of convergent splittings and approximate inverses for Hermitian positive definite matrices by applying stair matrices, their generalizations and iteration arithmetic. Analysis of the splittings and the approximate inverses is also prese...

متن کامل

Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency

This paper continues the theoretical and numerical study of the so-called factorized sparse approximate inverse (FSAI) preconditionings of symmetric positive-definite matrices and considers two new approaches to improving them. The first one is based on the a posteriori sparsification of an already constructed FSAI preconditioner, whereas the second one amounts to applying another FSAI precondi...

متن کامل

Properties of Central Symmetric X-Form Matrices

In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.

متن کامل

Two-stage spectral preconditioners for iterative eigensolvers

In this paper we present preconditioning techniques to accelerate the convergence of Krylov solvers at each step of an Inexact Newton’s method for the computation of the leftmost eigenpairs of large and sparse symmetric positive definite matrices arising in large scale scientific computations. We propose a two-stage spectral preconditioning strategy: the first stage produces a very rough approx...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016